Beyond Almost-Sure Termination
نویسنده
چکیده
The aim of this paper is to argue that models in cognitive science based on probabilistic computation should not be restricted to those procedures that almost surely (with probability 1) terminate. There are several reasons to consider nonterminating procedures as candidate components of cognitive models. One theoretical reason is that there is a perfect correspondence between the enumerable semi-measures and all probabilistic programs, as we demonstrate here (generalizing a better-known fact about computable measures and almostsurely halting programs). One practical reason is that the line between almost sure termination and non-termination is elusive, as well as arbitrary. We argue that this matters not only for theorists, but also potentially for a learner faced with the task of inducing programs from experience.
منابع مشابه
On the Hardness of Almost-Sure Termination
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost–sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is Σ 1– and Σ 0 2–complete, respectively. Deciding (universal) almost–sure termination as well as deciding whether the expected outcome of a program equals a gi...
متن کاملAnalyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard
This paper considers the computational hardness of computing expected outcomes and deciding almost–sure termination of probabilistic programs. We show that deciding almost–sure termination and deciding whether the expected outcome of a program equals a given rational value is Π2–complete. Computing lower and upper bounds on the expected outcome is shown to be recursively enumerable and Σ2–compl...
متن کاملProving Positive Almost Sure Termination Under Strategies
In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass....
متن کاملProving Positive Almost-Sure Termination
In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the ring of rules can be subject to some probabilistic laws. Considering rewrite rules subject to probabilities leads to numerous questions about the underlying notions and results. We focus here on the problem of termination of a set of probabilistic rewrite rules. A probabilistic rewrite s...
متن کاملAlmost sure exponential stability of stochastic reaction diffusion systems with Markovian jump
The stochastic reaction diffusion systems may suffer sudden shocks, in order to explain this phenomena, we use Markovian jumps to model stochastic reaction diffusion systems. In this paper, we are interested in almost sure exponential stability of stochastic reaction diffusion systems with Markovian jumps. Under some reasonable conditions, we show that the trivial solution of stocha...
متن کامل